Fixed points and partial orders

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence and fixed points by fuzzy orders

A general approach to fixed point theory is proposed which is related to the notion of fuzzy ordering. This approach extends both the fixed point theorems in metric spaces and the ones in ordered sets. © 2007 Elsevier B.V. All rights reserved.

متن کامل

Fixed Points on Partial Randomness

Algorithmic information theory (AIT, for short) is a theory of program-size and algorithmic randomness. One of the primary concepts of AIT is the Kolmogorov complexity K(s) of a finite binary string s, which is defined as the length of the shortest binary program for a universal decoding algorithm to output s. In this paper, we report on a quite new type of fixed point in computer science, call...

متن کامل

Diagonal arguments and fixed points

‎A universal schema for diagonalization was popularized by N.S‎. ‎Yanofsky (2003)‎, ‎based on a pioneering work of F.W‎. ‎Lawvere (1969)‎, ‎in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function‎. ‎It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema‎. ‎Here‎, ‎we fi...

متن کامل

Counting Partial Orders With A Fixed Number Of Comparable Pairs

In 1978, Dhar suggested a model of a lattice gas whose states are partial orders. In this context he raised the question of determining the number of partial orders with a xed number of comparable pairs. Dhar conjectured that in order to nd a good approximation to this number, it should suuce to enumerate families of layer posets. In this paper we prove this conjecture and thereby prepare the g...

متن کامل

Partial and total correctness as greatest and least fixed points

This paper studies Hoare triples in the context of any programming language specified by a small-step, possibly non-deterministic, operational semantics. We explain how the partial correctness interpretation of the triple can be characterised as the greatest fixed point of a function, and how the total correctness interpretation can be seen as the least fixed point of that very same function. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1976

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1976-0417867-x